Statistical complexity of dominant eigenvector calculation
نویسندگان
چکیده
منابع مشابه
Statistical complexity of dominant eigenvector calculation
We show that the number of arithmetic operations required to calculate a dominant -eigenvector of a real symmetric or complex Hermitian n × n matrix, when averaged over any density invariant under linear transformations that preserve the Frobenius norm, is bounded above by a polynomial in the size of the matrix. In fact, a specific upper bound is given in terms of n and . We also describe an es...
متن کاملComplexity results for some eigenvector problems
We consider the computation of eigenvectors x = (x1, . . . , xn) over the integers, where each component xi satisfies |xi| ≤ b for an integer b. We address various problems in this context, and analyze their computational complexity. We find that different problems are complete for the complexity classes NP, P ‖ , FNP//OptP[O(log n)], FP , P, and NP. Applying the results, finding bounded soluti...
متن کامل1 Bounds for the Dominant Eigenvector of a Graph
In this note we prove lower bounds on the components of the eigenvector associated with the dominant eigenvalue of a graph. These bounds depend only on the eccentricity of the corresponding node and on the eigenvalue As corrollary lower bounds on the dominant eigenvalue are derived, which depend on the diameter of the graph. These bounds were motivated by a heuristic algorithm for finding perip...
متن کاملEigenvector approximation leading to exponential speedup of quantum eigenvalue calculation.
We present an efficient method for preparing the initial state required by the eigenvalue approximation quantum algorithm of Abrams and Lloyd. Our method can be applied when solving continuous Hermitian eigenproblems, e.g., the Schrödinger equation, on a discrete grid. We start with a classically obtained eigenvector for a problem discretized on a coarse grid, and we efficiently construct, quan...
متن کاملthe effect of task complexity on lexical complexity and grammatical accuracy of efl learners’ argumentative writing
بر اساس فرضیه شناخت رابینسون (2001 و 2003 و 2005) و مدل ظرفیت توجه محدود اسکهان (1998)، این تحقیق تاثیر پیچیدگی تکلیف را بر پیچیدگی واژگان و صحت گرامری نوشتار مباحثه ای 60 نفر از دانشجویان زبان انگلیسی بررسی کرد. میزان پیچیدگی تکلیف از طریق فاکتورهای پراکندگی-منابع تعیین شد. همه ی شرکت کنندگان به صورت نیمه تصادفی به یکی از سه گروه: (1) گروه موضوع، (2) گروه موضوع + اندیشه و (3) گروه موضوع + اندی...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 1991
ISSN: 0885-064X
DOI: 10.1016/0885-064x(91)90025-s